Correction to: Analysis of convexly combined recursive inverse algorithms

Non-convexly constrained linear inverse problems

This paper considers the inversion of ill-posed linear operators. To regularise the problem the solution is enforced to lie in a non-convex subset. Theoretical properties for the stable inversion are derived and an iterative algorithm akin to the projected Landweber algorithm is studied. This work extends recent progress made on the efficient inversion of finite dimensional linear systems under...

Convexly constrained linear inverse problems: iterative least-squares and regularization

| In this paper, we consider robust inversion of linear operators with convex constraints. We present an iteration that converges to the minimum norm least squares solution; a stopping rule is shown to regularize the constrained inversion. A constrained Laplace inversion is computed to illustrate the proposed algorithm.

The Recursive Inverse Eigenvalue Problem

The recursive inverse eigenvalue problem for matrices is studied where for each leading principle submatrix an eigenvalue and associated left and right eigenvectors are assigned Existence and uniqueness results as well as explicit formulas are proven and applications to nonnegative matrices Z matrices M matrices symmetric matrices Stieltjes matrices and inverse M matrices are considered

applying transitivity theory to gender analysis of efl textbook: : a comparative study.

efl/esl textbooks have been regarded as essential language teaching materials with which the learners spend about 70 up to 90 percent of their class time. the important role they play and their vast use make them not only influential in learning the language but also in shaping values and attitudes. put it another way, textbooks socialize learners using their contents (i.e. texts, illustrations...

Convexly Generated ¿-dimensional Measures